Routing optimization of fourth party logistics with reliability constraints based on Messy GA

摘要

Purpose: The purpose of this paper is to choose a optimal routing in fourth party logistics\ud(4PL) with the objective of transportation cost minimization under reliability level constraint.\udDesign/methodology/approach: Reliability theory is applied to routing optimization\udproblem. A mathematical model of the 4PL routing optimization problem with reliability\udconstraints is built, which aims to find a route at the minimum cost. Due to the 4PL routing\udproblem is NP-hard, two algorithms are designed: Messy Genetic Algorithm (Messy GA) and\udEnumeration Algorithm (EA).\udFindings: Through the model and algorithm, 4PL company can obtain the optimal solution\udquickly and effectively, according to customer’s reliability requirements.\udPractical implications: We give an example for test the effectiveness of the method and the\udalgorithm.\udOriginality/value: In this paper, we put objective factors that cause disturbances of\udtransportation time into consideration, and reliability theory is applied to 4PL routing\udoptimization problem. A Messy GA with double arrays encoding method is designed to solve\udthe problem.